Self-Supervised Hypergraph Representation Learning for Sociological Analysis
نویسندگان
چکیده
Modern sociology has profoundly uncovered many convincing social criteria for behavioral analysis. Unfortunately, of them are too subjective to be measured and very challenging presented in online networks (OSNs) the large data volume complicated environments explored. On other hand, mining techniques can better find patterns but leave behind unnatural understanding humans. Although there some works trying integrate observations specific tasks, they still hard applied more general cases. In this paper, we propose a fundamental methodology support further fusion sociological criteria. Our highlights three-fold: First, an effective hypergraph awareness fast line graph construction framework. The indicate interactions between individuals their because each edge (a.k.a hyperedge) contains than two nodes, which is perfect describe social. A treats environment as super node with underlying influence different environments. way, go beyond traditional pair-wise relations explore richer under various criteria; Second, novel hypergraph-based neural network learn flowing from users users, environments, learned via task-free method, making our model flexible tasks analysis; Third, both qualitative quantitive solutions effectively evaluate most common like conformity, equivalence, environmental evolving polarization. extensive experiments show that framework user behaviors
منابع مشابه
Combinative hypergraph learning for semi-supervised image classification
Recent years have witnessed a surge of interest in hypergraph-based transductive image classification. Hypergraph-based transductive learning models the high-order relationship of samples by using a hyperedge to link multiple samples. In order to extend the high-order relationship of samples, we incorporate linear correlation of sparse representation to hypergraph learning framework to improve ...
متن کاملRepresentation Theorem for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the safisfiability of sets of clauses with respect to that hypergraph (see [2], [4]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملRepresentation Theorems for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملHypergraph Spectra for Semi-supervised Feature Selection
In many data analysis tasks, one is often confronted with the problem of selecting features from very high dimensional data. Most existing feature selection methods focus on ranking individual features based on a utility criterion, and select the optimal feature set in a greedy manner. However, the feature combinations found in this way do not give optimal classification performance, since they...
متن کاملSupervised Learning for Self-Generating Neural Networks
In this paper, supervised learning for Self-Generating Neural Networks (SGNN) method, which was originally developed for the purpose of unsupervised learning, is discussed. An information analytical method is proposed to assign weights to attributes in the training examples if class information is available. This significantly improves the learning speed and the accuracy of the SGNN classiier. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2023
ISSN: ['1558-2191', '1041-4347', '2326-3865']
DOI: https://doi.org/10.1109/tkde.2023.3235312